Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph
نویسندگان
چکیده
A hyper-star graph HS(n,k) provides a promising topology for interconnection networks of parallel processing systems because it inherits the advantages of a hypercube and a star graph. In this paper, we focus on fault-tolerant routing in an HS(n,k) graph with faulty nodes and propose an algorithm to establish a fault-free path between a pair of non-faulty nodes. The algorithm uses limited global information called routing capabilities. Though routing capabilities were originally invented for a hypercube, we extend their notion so that they can be applied to an HS(n,k) graph, which is asymmetric. We have proved that the time complexity to calculate routing capabilities with respect to all the distances at each node is O(n2). In addition, we present the results of a computer experiment to verify that our algorithm attains high reachability to the destination nodes.
منابع مشابه
A Fault-tolerant Routing Algorithm based on Safety Levels in a Hyper-Star Graph
A hyper-star graph HS(n, k) provides a promising topology for interconnection networks of parallel processing systems because it combines the merits of a hypercube and a star graph. In this study, we propose a fault-tolerant routing algorithm that establishes a fault-free path between any pair of non-faulty nodes in an HS(n, k) with faulty nodes by using limited global information called safety...
متن کاملA Stochastic Fault-tolerant Routing Algorithm in Hyper-star Graphs
A hyper-star graph HS(2n, n) is promising as a generic topology for interconnection networks of parallel processing systems because it has merits of a hypercube and a star graph. This paper proposes an O(n log n) algorithm that constructs a faultfree path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes. For each node and each distance, the algorithm first calculates an estimat...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملlgorithms of the Hyper - Star Graph and its Related Graphs
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also bee...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کامل